Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs
نویسندگان
چکیده
If a graph has no induced subgraph isomorphic to H1 or H2 then it is said to be (H1, H2)-free. Dabrowski and Paulusma found 13 open cases for the question whether the clique-width of (H1, H2)-free graphs is bounded. One of them is the class of (S1,2,2,triangle)-free graphs. In this paper we show that these graphs have bounded clique-width. Thus, also (P1+2P2,triangle)-free graphs have bounded clique-width which solves another open problem of Dabrowski and Paulusma.
منابع مشابه
Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes
Daligault, Rao and Thomassé asked whether every hereditary graph class that is well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev (JCTB 2017+) gave a negative answer to this question, but their counterexample is a class that can only be characterised by infinitely many forbidden induced subgraphs. This raises the issue of whether the questio...
متن کاملP6- and triangle-free graphs revisited: structure and bounded clique-width
The MaximumWeight Stable Set (MWS) Problem is one of the fundamental problems on graphs. It is well-known to be NP-complete for triangle-free graphs, and Mosca has shown that it is solvable in polynomial time when restricted to P6and triangle-free graphs. We give a complete structure analysis of (nonbipartite) P6and triangle-free graphs which are prime in the sense of modular decomposition. It ...
متن کاملStructure and algorithms for (cap, even hole)-free graphs
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with the cycle. In this paper, we consider (cap, even hole)-free graphs, and more generally, (cap, 4-hole)-free odd-signable graphs. We give an explicit construction of these graphs. We prove that every such graph G has a ...
متن کاملClique-Width for Graph Classes Closed under Complementation
Clique-width is an important graph parameter due to its algorithmic and structural properties. A graph class is hereditary if it can be characterized by a (not necessarily finite) set H of forbidden induced subgraphs. We initiate a systematic study into the boundedness of clique-width of hereditary graph classes closed under complementation. First, we extend the known classification for the |H|...
متن کاملChordal bipartite graphs of bounded tree- and clique-width
A bipartite graph is chordal bipartite if every cycle of length at least six has a chord. In the class of chordal bipartite graphs the tree-width and the clique-width are unbounded. Our main results are that chordal bipartite graphs of bounded vertex degree have bounded tree-width and that k-fork-free chordal bipartite graphs have bounded clique-width, where a k-fork is the graph arising from a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1608.01820 شماره
صفحات -
تاریخ انتشار 2016